Search results for "multiagent system"
showing 10 items of 108 documents
Vers la conception d'une action de réponse pour la gestion de catastrophe, utilisant la modélisation de connaissances
2018
International audience; Ce travail de positionnement souligne les problèmes actuels liés aux diffé-rents aspects de la collaboration inter agence pendant la réponse à une catastrophe. La coordination et la coopération dépendent de l'usage et du partage d'informations, qui doivent faire face aux problèmes d'interopérabilité, de droits d'accès et de qualité. Le projet de recherche a pour but de fournir une évaluation de l'impact de l'information sur la réponse à une catastrophe afin d'aider la prise de décision concernant l'usage et le partage de l'information en répondant à des questions telles que: quelles informa-tions devraient être partagées ou quelle qualité de données utilisées pour am…
Supporting Autonomy in Agent Oriented Methodologies
2016
Designing a software solution for a complex systems is always a demanding task, it becomes much more complex if we consider to design a multi agent system where agents have to exhibit autonomy; which abstractions and which concepts to take into consideration when using a design methodology we would like to support autonomy? In this paper, we answer this question by studying and analyzing literature on the concept of agents in order to establish the basic set of concepts an agent oriented methodology has to deal with.
Edge-Based Missing Data Imputation in Large-Scale Environments
2021
Smart cities leverage large amounts of data acquired in the urban environment in the context of decision support tools. These tools enable monitoring the environment to improve the quality of services offered to citizens. The increasing diffusion of personal Internet of things devices capable of sensing the physical environment allows for low-cost solutions to acquire a large amount of information within the urban environment. On the one hand, the use of mobile and intermittent sensors implies new scenarios of large-scale data analysis
A Predictive Approach for the Efficient Distribution of Agent-Based Systems on a Hybrid-Cloud
2018
International audience; Hybrid clouds are increasingly used to outsource non-critical applications to public clouds. However, the main challenge within such environments, is to ensure a cost-efficient distribution of the systems between the resources that are on/off premises. For Multi Agent Systems (MAS), this challenge is deepened due to irregular workload progress and intensive communication between the agents, which may result in high computing and data transfer costs. Thus, in this paper we propose a generic framework for adaptive cost-efficient deployment of MAS with a special focus on hybrid clouds. The framework is based mainly on the use of a performance evaluation process that con…
Semantic oriented data structuration for MABS Application to BIM
2013
International audience; This paper presents a multiagent-based simulation approach to qualify the usage of buildings from the design phase. Our approach combines ontology and evolution process based on machine learning algorithms. The ontology relies on semantic data structures for the representation of environment components, agent knowledge and all data generated during the simulation.
Recursive and bargaining values
2021
Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…
Simulation-based estimation of branching models for LTR retrotransposons
2017
Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …
Robust dynamic cooperative games
2009
Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…
Efficient cluster-based routing algorithm for body sensor networks
2018
International audience; Body Sensor Networks have gained a lot of research interest lately for the variety of applications they can serve. In such networks where nodes might hold critical information about people's lives, designing efficient routing schemes is very important to guarantee data delivery with the lowest delay and energy consumption. Even though some cluster-based routing schemes were proposed in the literature, none of them offer a complete solution that guarantees energy and delay efficient routing in BSN. In this paper, we propose a robust cluster- based algorithm that increases the routing efficiency through every step of the routing process: cluster formation, cluster head…
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.